The signed (|G| –1)-subdomination number of balanced hypercubes
نویسندگان
چکیده
Let G = BHn be a n - dimensional balanced hypercube. As topology of interconnection network, hypercubes are widely used in many areas. The signed k subdomination number graphs is an important parameter the domination theory. In this paper, according to properties hypercubes, (|G| –1) when 2 determined by classified discussion and exhaustived method.
منابع مشابه
Signed edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...
متن کاملSigned star k-subdomination numbers in graphs
Let G be a simple graph without isolated vertex with vertex set V (G) and edge set E(G). A function f : E(G) −→ {−1, 1} is said to be a signed star k-subdominating function of G if ∑ e∈E(v) f (e) ≥ 1 for at least k vertices v of G, where E(v) = {uv ∈ E(G) | u ∈ N (v)}. The value min ∑ e∈E(G) f (e), taking over all signed star k-subdominating function f of G is called the signed star k-subdomina...
متن کاملUpper bounds for the k-subdomination number of graphs
For a positive integer k, a k-subdominating function of G=(V; E) is a function f :V → {−1; 1} such that the sum of the function values, taken over closed neighborhoods of vertices, is at least one for at least k vertices of G. The sum of the function values taken over all vertices is called the aggregate of f and the minimum aggregate among all k-subdominating functions of G is the k-subdominat...
متن کاملBalanced independent sets in hypercubes
The n-dimensional hypercube Qn has many maximal independent sets of vertices. We study the cardinality of those maximal independent sets which are balanced , i.e. exactly half of whose vertices have even weight, obtaining both upper and lower bounds for the maximum value. For n ≤ 7 we obtain the exact value. For all odd n, we conjecture that the exact value is 2n−1 − ( n−1 (n−1)/2 ) . We also c...
متن کاملMatching preclusion for balanced hypercubes
Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion leaves the resultin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: ['1742-6588', '1742-6596']
DOI: https://doi.org/10.1088/1742-6596/1978/1/012040